Universal Exponentiation Algorithm
نویسندگان
چکیده
Very few countermeasures are known to protect an exponentiation against simple side-channel analyses. Moreover, all of them are heuristic. This paper presents a universal exponentiation algorithm. By tying the exponent to a corresponding addition chain, our algorithm can virtually execute any exponentiation method. Our aim is to transfer the security of the exponentiation method being implemented to the exponent itself. As a result, we hopefully tend to reconcile the provable security notions of modern cryptography with realworld implementations of exponentiation-based cryptosystems.
منابع مشابه
Universal Exponentiation Algorithm – A First Step Towards Provable SPA - resistance –
Very few countermeasures are known to protect an exponentiation against simple side-channel analyses. Moreover, all of them are heuristic. This paper presents a universal exponentiation algorithm. By tying the exponent to a corresponding addition chain, our algorithm can virtually execute any exponentiation method. Our aim is to transfer the security of the exponentiation method being implement...
متن کاملEfficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملFast and Constant-Time Implementation of Modular Exponentiation
Modular exponentiation is an important operation which requires a vast amount of computations. Therefore, it is crucial to build fast exponentiation schemes. Since Cache and data-dependent branching behavior can alter the runtime of an algorithm significantly, it is also important to build an exponentiation scheme with constant run-time. However, such approaches have traditionally added signifi...
متن کاملAn Efficient Montgomery Exponentiation Algorithm for Cryptographic Applications
Efficient computation of the modular exponentiations is very important and useful for public-key cryptosystems. In this paper, an efficient parallel binary exponentiation algorithm is proposed which based on the Montgomery multiplication algorithm, the signed-digit-folding (SDF) and common-multiplicand-multiplicand (CMM) techniques. By using the CMM technique of computing the common part from t...
متن کاملAn Efficient Parallel CMM-CSD Modular Exponentiation Algorithm by Using a New Modified Modular Multiplication Algorithm
This paper presents a new modified Montgomery modular multiplication algorithm based on canonical signed-digit (CSD) representation, and sliding window method. In this modified Montgomery modular multiplication algorithm, signed-digit recoding technique is used in order to increase probability of the zero bits. Also sliding window method is used in order to reduce the multiplication steps consi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001